Decidability of Uniform Recurrence of Morphic Sequences
نویسنده
چکیده
We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic sequences are primitive substitutive sequences.
منابع مشابه
On Uniformly Recurrent Morphic Sequences
In the paper we mainly deal with two well-known types of in nite words: morphic and uniformly recurrent (=almost periodic). We discuss the problem of nding criterion of uniform recurrence for morphic sequences and give e ective polynomial-time such criterion in two particular cases: pure morphic sequences and automatic sequences. We also prove that factor complexity of arbitrary uniformly recur...
متن کاملA Taxonomy of Morphic Sequences
In this note we classify sequences according to whether they are morphic, pure morphic, uniform morphic, pure uniform morphic, primitive morphic, or pure primitive morphic, and for each possibility we either give an example or prove that no example is possible.
متن کاملOn Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm solving the problem is found. A result more or less supporting the conjecture of decidability of the general problem is given.
متن کاملA Hierarchy of Automatic Words having a Decidable MSO Theory
We investigate automatic presentations of infinite words. Starting points of our study are the works of Rigo and Maes, and Carton and Thomas concerning the lexicographic presentation, respectively the decidability of the MSO theory of morphic words. Refining their techniques we observe that the lexicographic presentation of a (morphic) word is canonical in a certain sense. We then go on to gene...
متن کاملOn Subword Complexity of Morphic Sequences
We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either Θ(n) for some k ∈ N, or is
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 24 شماره
صفحات -
تاریخ انتشار 2013